CR-Prolog2: CR-Prolog with Ordered Disjunction
نویسندگان
چکیده
We present CR-Prolog2, an extension of CR-Prolog with an improved semantics, and allowing ordered disjunction in the head of both regular rules and consistency-restoring rules. The new semantics yields intuitive conclusions in cases when CR-Prolog would give unintuitive results. The use of ordered disjunction often allows for a more concise, easier to read, representation of knowledge. We also show how CR-Prolog2 can be used to represent preferences intended both as strict preferences (like in CR-Prolog), and as desires (like in LPOD, where ordered disjunction was initially introduced). Finally, we show how the new language can be used to represent complex knowledge and to perform fairly sophisticated reasoning tasks.
منابع مشابه
CR-Prolog with Ordered Disjunction
We present CR-Prolog , an extension of CR-Prolog with an improved semantics, and allowing ordered disjunction in the head of both regular rules and consistency-restoring rules. The new semantics yields intuitive conclusions in cases when CR-Prolog would give unintuitive results. The use of ordered disjunction often allows for a more concise, easier to read, representation of knowledge. We also ...
متن کاملSplitting a CR-Prolog Program
CR-Prolog is an extension of A-Prolog, the knowledge representation language at the core of the Answer Set Programming paradigm. CR-Prolog is based on the introduction in A-Prolog of consistency-restoring rules (cr-rules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstra...
متن کاملcr-models: An Inference Engine for CR-Prolog
CR-Prolog is an extension of the knowledge representation language A-Prolog. The extension is built around the introduction of consistency-restoring rules (cr-rules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstrated in the literature, with examples that include planni...
متن کاملSPARC - Sorted ASP with Consistency Restoring Rules
This is a preliminary report on the work aimed at making CR-Prolog – a version of ASP with consistency restoring rules – more suitable for use in teaching and large applications. First we describe a sorted version of CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog into the language of DLV and compare the performance with the state of the art CR-Prolog solver. The r...
متن کاملCR-Prolog as a Specification Language for Constraint Satisfaction Problems
In this paper we describe an approach for integrating CR-Prolog and constraint programming, in which CR-Prolog is viewed as a specification language for constraint satisfaction problems. Differently from other methods of integrating ASP and constraint programming, our approach has the advantage of allowing the use of off-the-shelf, unmodified ASP solvers and constraint solvers, and of global co...
متن کامل